Order-sorted Equational Unification Revisited
نویسندگان
چکیده
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of interest, using order-sorted unification over unsorted unification is able to reduce the total number of unifiers considered, and dramatically improve the performance of the Maude-NRL tool.
منابع مشابه
A modular order-sorted equational generalization algorithm
Generalization, also called anti-unification, is the dual of unification. Given terms t and t′, a generalization is a term t′′ of which t and t′ are substitution instances. The dual of a most general unifier (mgu) is that of least general generalization (lgg). In this work, we extend the known untyped generalization algorithm to, first, an order-sorted typed setting with sorts, subsorts, and su...
متن کاملVariants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6
This paper introduces some novel features of Maude 2.6 focusing on the variants of a term. Given an equational theory (Σ,Ax∪E), the E,Ax-variants of a term t are understood as the set of all pairs consisting of a substitution σ and the E,Ax-canonical form of tσ . The equational theory (Ax∪E) has the finite variant property iff there is a finite set of most general variants. We have added suppor...
متن کاملUnification and Anti-unification modulo Equational Theories
Automated reasoning modulo an equational theory E is a fundamental technique in many applications. If E can be split as a disjoint union R ∪ Ax in such a way that R is a set of rewrite rules that are confluent, terminating, sort-decreasing, and coherent modulo a set of equational axioms Ax, it is well-known that narrowing with R modulo Ax provides a complete E-unification algorithm. However, na...
متن کاملA Soft Stairway to Institutions
Abs t rac t . The notion of institution is dissected into somewhat weaker notions. We introduce a novel notion of institution morphism, and characterize preservation of institution properties by corresponding properties of such morphisms. Target of this work is the stepwise construction of a general framework for translating logics, and algebraic specifications using logical systems. Earlier tr...
متن کاملUnification and Narrowing in Maude 2.4
Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications, and has a relatively large worldwide user and open-source developer base. This paper introduces novel features of Maude 2.4 including support for unification and narrowing. Unification is supported in Core Maude, the core rewri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 290 شماره
صفحات -
تاریخ انتشار 2012